Embedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
نویسندگان
چکیده
Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and shows that a bubble-sort graph Bn can be embedded in a transposition graph Tn with dilation 1 and expansion 1. In contrast, a macro-star graph MS(2, n) can be embedded in a transposition graph with dilation n, but with an average dilation of 2 or under.
منابع مشابه
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
We propose a new class of interconnection networks, called macro-star networks, which belong to the class of Cayley graphs and use the star graph as a basic building module. A macro-star network can have node degree that is considerably smaller than that of a star graph of the same size, and diameter that is sub-logarithmic and asymptotically within a factor of 1.25 from a universal lower bound...
متن کاملTransposition Networks as a Class of Fault-Tolerant Robust Networks
The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. The networks under study belong to a subclass of Cayley graphs whose generators are subsets of all possible transpositions. We specifically focus on star and bubble-sort networks. Our approach is to augment existing dimensions (or generators) with one or more dimensions. If the added dimension is c...
متن کاملThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...
متن کاملParallel Algorithms on the Rotation-Exchange Network – A Trivalent Variant of the Star Graph
We investigate a trivalent Cayley graph, which we call the rotation-exchange (RE) network, and present communication algorithms to perform one-to-one routing, singlenode broadcasting, multinode broadcasting, and total exchange in it. The RE network can be viewed as a stargraph counterpart to the hypercubic shuffle-exchange network, with the important difference that the RE network is regular an...
متن کاملRouting and Embeddings in Super Cayley Graphs
In this paper, we introduce super Cayley graphs, a class of communication-efficient networks for parallel processing. We show that super Cayley graphs can embed trees, meshes, hypercubes, as well as star, bubble-sort graphs, and transposition networks with constant dilation. We also show that algorithms developed for star graphs can be emulated on suitably constructed super Cayley graphs with a...
متن کامل